Infimal convolution, c-subdifferentiability, and Fenchel duality in evenly convex optimization

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convex Repeated Games and Fenchel Duality

We describe and analyze an algorithmic framework for playing convex repeatedgames. In each trial of the repeated game, the first player predicts a vector andthen the second player responds with a loss function over the vector. Based on ageneralization of Fenchel duality, we derive an algorithmic framework for the firstplayer and analyze the player’s regret. We then use our a...

متن کامل

Stable and Total Fenchel Duality for Convex Optimization Problems in Locally Convex Spaces

STABLE AND TOTAL FENCHEL DUALITY FOR CONVEX OPTIMIZATION PROBLEMS IN LOCALLY CONVEX SPACES∗ CHONG LI† , DONGHUI FANG‡ , GENARO LÓPEZ§ , AND MARCO A. LÓPEZ¶ Abstract. We consider the optimization problem (PA) infx∈X{f(x) + g(Ax)} where f and g are proper convex functions defined on locally convex Hausdorff topological vector spaces X and Y , respectively, and A is a linear operator from X to Y ....

متن کامل

Strong and Converse Fenchel Duality for Vector Optimization Problems in Locally Convex Spaces

In relation to the vector optimization problem v-minx∈X(f + g ◦ A)(x), with f, g proper and cone-convex functions and A : X → Y a linear continuous operator between separated locally convex spaces, we define a general vector Fenchel-type dual problem. For the primal-dual pair we prove weak, and under appropriate regularity conditions, strong and converse duality. In the particular case when the...

متن کامل

Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces

We consider the DC optimization problem (P) inf x∈X {(f1(x) − f2(x)) + (g1(Ax) − g2(Ax))}, where f1, f2, g1 and g2 are proper convex functions defined on locally convex Hausdorff topological vector spaces X and Y respectively, and A is a linear continuous operator from X to Y . Adopting the standard convexification technique, a Fenchel dual problem of (P) is given. By using properties of the ep...

متن کامل

Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces

We consider the DC (difference of two convex functions) optimization problem ðPÞ inf x∈Xfðf 1ðxÞ− f 2ðxÞÞ þ ðg1ðAxÞ− g2ðAxÞÞg, where f 1, f 2, g1, and g2 are proper convex functions defined on locally convex Hausdorff topological vector spaces X and Y , and A is a linear continuous operator from X to Y . Adopting different tactics, two types of the Fenchel dual problems of ðPÞ are given. By usi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: TOP

سال: 2011

ISSN: 1134-5764,1863-8279

DOI: 10.1007/s11750-011-0208-6